Digitizing Interval Duration Logic

نویسندگان

  • Gaurav Chakravorty
  • Paritosh K. Pandya
چکیده

Interval Duration Logic, (IDL), is a dense time logic for specifying properties of real-time systems. Its validity is undecidable. A corresponding discrete-time logic QDDC has decidable validity. In this paper, we consider a reduction of IDL validity question to QDDC validity using notions of digitization. A new notion of Strong Closure under Inverse Digitization, SCID, is proposed. It is shown that for all SCID formulae, the dense and the discrete-time validity coincide. Moreover, SCID has good algebraic properties which allows us to conveniently prove that many interesting IDL formulae are in fact SCID. We also give some approximation techniques to strengthen/weaken formulae to SCID form. We illustrate the use of this approach by an example where a densetime IDL formula is digitized and then verified using the QDDC validity checker, DCVALID.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems

The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC ) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem for the system of probabilistic ITL with respect to an abstract semantics and a relative completeness theorem for the system of probabilistic DC with respect ...

متن کامل

PIL — an Interval Temporal Logic for Real-Time Requirements in embedded Systems

The precise and understandable description of temporal requirements is of increasing importance in the development of embedded systems. In colloquial speech, it is very common to state temporal properties by using time points to denote starting or end points of a given property. On the other hand intervals are appropriate, for example, for the description of a desired duration of a property. To...

متن کامل

A Complete Proof System for First-order Interval Temporal Logic with Projection

This paper presents an ω-complete proof system for the extension of first order Interval Temporal Logic (ITL, [12, 15, 4]) by a projection operator [16, 11]. Alternative earlier approaches to the axiomatisation of projection in ITL are briefly presented and discussed. An extension of the proof system which is complete for the extension of Duration Calculus (DC , [24]) by projection is also given.

متن کامل

Liveness and Fairness in Duration Calculus

This paper embeds durations in an interval temporal logic proposed by Venema. The resulting logic, DCL, is a conservative extension of the original Duration Calculus with two extra chopping operators. In contrast to the original Duration Calculus, DCL can be used to specify and verify abstract liveness and fairness properties of systems. In fact, it is shown that durations are useful for specif...

متن کامل

A mixed decision method for duration calculus

The Duration Calculus is an interval logic with an additional notion of duration. It became one of the main references of real-time system specification for which it was introduced. From a practical point of view an important challenge is to define automated proof procedures for this calculus. Since the propositional Duration Calculus is undecidable, in this paper we isolate a fragment and we d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003